Information Geometrical Framework for Analyzing Belief Propagation Decoder
نویسندگان
چکیده
The mystery of belief propagation (BP) decoder, especially of the turbo decoding, is studied from information geometrical viewpoint. The loopy belief network (BN) of turbo codes makes it difficult to obtain the true “belief” by BP, and the characteristics of the algorithm and its equilibrium are not clearly understood. Our study gives an intuitive understanding of the mechanism, and a new framework for the analysis. Based on the framework, we reveal basic properties of the turbo decoding.
منابع مشابه
Belief propagation and turbo code: Information geometrical view
In this article, we describe the information geometrical understanding of the belief propagation decoder, especially of the turbo decoding. The turbo decoding was proposed by Berrou et al. early in 90’s, and many studies have been appeared on this practical and powerful error correcting code. Even though many experimental results support the potential of the turbo decoding, there is not suffici...
متن کاملInformation-Geometrical Significance of Sparsity in Gallager Codes
We report a result of perturbation analysis on decoding error of the belief propagation decoder for Gallager codes. The analysis is based on information geometry, and it shows that the principal term of decoding error at equilibrium comes from the m-embedding curvature of the log-linear submanifold spanned by the estimated pseudoposteriors, one for the full marginal, and K for partial posterior...
متن کاملStochastic Reasoning, Free Energy, and Information Geometry
Belief propagation (BP) is a universal method of stochastic reasoning. It gives exact inference for stochastic models with tree interactions and works surprisingly well even if the models have loopy interactions. Its performance has been analyzed separately in many fields, such as AI, statistical physics, information theory, and information geometry. This article gives a unified framework for u...
متن کاملDesign and Synthesis of Binary Ldpc Decoder
This paper is aimed to optimize the binary LDPC decoder which has been shown to outperform commonly used codes for many communications and storage channels. Currently proposed binary LDPC decoder architectures have very high rates close to the channel capacity for the large code word length, in this research work we had presented a decoding algorithm based on belief propagation and provide deta...
متن کاملFinite Alphabet Iterative Decoders, Part I: Decoding Beyond Belief Propagation on BSC
We introduce a new paradigm for finite precision iterative decoding on low-density parity-check codes over the Binary Symmetric channel. The messages take values from a finite alphabet, and unlike traditional quantized decoders which are quantized versions of the Belief propagation (BP) decoder, the proposed finite alphabet iterative decoders (FAIDs) do not propagate quantized probabilities or ...
متن کامل